Query Processing for Partial Information Databases in QUIXOTE

نویسندگان

  • Kazumasa Yokota
  • Hiroshi Tsuda
  • Toshihiro Nishioka
  • Satoshi Tojo
چکیده

In advanced knowledge processing, partial information plays an important role in coping with complex data and knowledge. To handle such information, we developed the knowledge representation language (which may be regarded as a deductive object-oriented database language) QUIXOT E. The language has the features of both logic and object-orientation concepts, as well as database features. In this paper, we introduce the query processing mechanism for partial information databases in QUIXOT E, as a tool for e ective data processing, taking the example of legal reasoning, and show its applicability to many applications in arti cial intelligence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Processing Using Quixote Limited Distribution Notice Query Processing Using Quixote

This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and speciic requests. After outside...

متن کامل

Constructing a Legal Database on Quixote

Legal reasoning is one application of large-scale knowledge information processing, where arti cial intelligence, natural language processing, databases and other technologies are integrated. It is the target for the next-generation of databases. In order to investigate whether or not the deductive object oriented database (DOOD) language/systemQUIXOT E is e ective in legal reasoing, we are bot...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

انتخاب مناسب‌ترین زبان پرس‌وجو برای استفاده از فرا‌‌پیوندها جهت استخراج داده‌ها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES

Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...

متن کامل

An Effective Path-aware Approach for Keyword Search over Data Graphs

Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994